Sufficient sparseness conditions forG2to be(Δ+1)-choosable, whenΔ≥5
نویسندگان
چکیده
منابع مشابه
Sufficient sparseness conditions for G2 to be (Δ+1)-choosable, when Δ≥5
We determine the list chromatic number of the square of a graph χl(G 2) in terms of its maximum degree ∆ when its maximum average degree, denoted mad(G), is sufficiently small. For ∆ ≥ 6, if mad(G) < 2 + 4∆−8 5∆+2 , then χl(G 2) = ∆ + 1. In particular, if G is planar with girth g ≥ 7 + 12 ∆−2 , then χl(G 2) = ∆ + 1. Under the same conditions, χil(G) = ∆, where χ i l is the list injective chroma...
متن کاملSufficient conditions for univalence and starlikeness
It is known that the condition $mathfrak {Re} left{zf'(z)/f(z)right}>0$, $|z|
متن کاملSufficient conditions for admissibility
Sufficient conditions for the finite and infinite-time admissibility of an observation operator are given. It is shown that the estimates of Weiss are close to being sufficient. If the semigroup is surjective, then the estimate is sufficient.
متن کاملSufficient Conditions for Multiplyconstrained
are smooth functions deened on a Hilbert space H. We derive suucient conditions for I to have a strong local minimum at a point y subject to the n constraints J i = 0.
متن کاملSufficient Conditions For
A number of robust stability problems take the following form: A polynomial has real coefficients which are multiaffine in real parameters that are confined to a box in parameter space. An efficient method is required for checking the stability of this set of polynomials. We prerent two sufficient conditions in this paper. They involve checking certain properties a t the corners and edges of th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2014
ISSN: 0166-218X
DOI: 10.1016/j.dam.2013.08.025